#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>

using namespace std;

void Swap(int* a, int* b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}
void portsort(int* a, int left, int right)
{
	if (left >= right)
	{
		return;
	}
	int begin = left;
	int end = right;
	int leftin = a[left];
	while (left < right)
	{
		while (a[right] >= leftin&&left<right)
		{
			right--;
		}
		while (a[left] <= leftin&&left<right)
		{
			left++;
		}
		Swap(&a[left], &a[right]);
	}
	Swap(&a[left], &a[begin]);
	portsort(a, begin, left - 1);
	portsort(a, left+1, end);
}
void selectsort(int* a, int n)
{
	int begin = 0; int end = n - 1;
	int max = begin; int min = begin;
	while (begin < end)
	{
		for (int i = begin; i <= end; i++)
		{
			if (a[max] < a[i])
			{
				max = i;
			}
			if (a[min]> a[i])
			{
				min =i;
			}
		}
		Swap(&a[begin], &a[min]);
		if (begin == max)
		{
			max = min;
		}
	
		Swap(&a[end], &a[max]);
		begin++; end--;
	}
}
void shellsort(int* data,int n)
{
	int gap = 3;
	while (gap)
	{
			for (int j = 0; j < n-gap; j+= gap)
			{
				int tmp = data[j+gap];
				int end = j;
				while (end >= 0)
				{
					if (data[end] > tmp)
					{
						data[j + gap] = data[end];
						end-= gap;
					}
					else
					{
						break;
					}
				}
				data[end + gap] = tmp;
			}
		gap--;
	}
}
void meragesort(int *a,int begin,int end,int *tmp)
{
	if (begin == end)
	{
		return;
	}
	int mid = (begin+end) / 2;
	meragesort(a, begin, mid, tmp);
	meragesort(a, mid+1, end, tmp);
	int begin1 = begin; int end1 = mid;
	int begin2 = mid + 1; int end2 = end;
	int i = begin1;
	while (begin1 <= end1 && begin2 <= end2)
	{
		if (a[begin1] < a[begin2])
		{
			tmp[i++] = a[begin1++];
		}
		else
		{
			tmp[i++] = a[begin2++];
		}
	}
	while (begin1 <= end1)
	{
		tmp[i++] = a[begin1++];
	}
	while (begin2 <= end2)
	{
		tmp[i++] = a[begin2++];
	}
	memcpy(a+begin, tmp+begin, sizeof(int) * (end - begin+1));
	
}
void Print(int* data,int n)
{
	for (int i = 0; i < n; i++)
	{
		cout << data[i] << " ";
	}

}
void MerAgeSort(int *a,int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);
	meragesort(a, 0, n - 1, tmp);
	Print(a, 10);
}
int main()
{
	int a[10] = { 3,5,6,2,1,6,7,10,2,3 };
	float num = 2.1;
	float sum = 129;
	int n = 1;
	while (num <= sum)
	{
		num *= 1.06;
		n++;
	}
	cout << n << endl;
	//shellsort(a, 10);
	//selectsort(a, 10);
	//portsort(a, 0, 9);
	//Print(a,10);
	//MerAgeSort(a, 10);
	return 0;
}